<div class="problemindexholder" problemindex="A">
 <div class="ttypography">
  <div class="problem-statement">
   <div class="header">
    <div class="title">
     A. Vicious Keyboard
    </div>
    <div class="time-limit">
     <div class="property-title">
      time limit per test
     </div>
     2 seconds
    </div>
    <div class="memory-limit">
     <div class="property-title">
      memory limit per test
     </div>
     256 megabytes
    </div>
    <div class="input-file">
     <div class="property-title">
      input
     </div>
     standard input
    </div>
    <div class="output-file">
     <div class="property-title">
      output
     </div>
     standard output
    </div>
   </div>
   <div>
    <p>
     Tonio has a keyboard with only two letters, "
     <span class="tex-font-style-tt">
      V
     </span>
     " and "
     <span class="tex-font-style-tt">
      K
     </span>
     ".
    </p>
    <p>
     One day, he has typed out a string
     <span class="tex-span">
      <i>
       s
      </i>
     </span>
     with only these two letters. He really likes it when the string "
     <span class="tex-font-style-tt">
      VK
     </span>
     " appears, so he wishes to change at most one letter in the string (or do no changes) to maximize the number of occurrences of that string. Compute the maximum number of times "
     <span class="tex-font-style-tt">
      VK
     </span>
     " can appear as a substring (i. e. a letter "
     <span class="tex-font-style-tt">
      K
     </span>
     " right after a letter "
     <span class="tex-font-style-tt">
      V
     </span>
     ") in the resulting string.
    </p>
   </div>
   <div class="input-specification">
    <div class="section-title">
     Input
    </div>
    <p>
     The first line will contain a string
     <span class="tex-span">
      <i>
       s
      </i>
     </span>
     consisting only of uppercase English letters "
     <span class="tex-font-style-tt">
      V
     </span>
     " and "
     <span class="tex-font-style-tt">
      K
     </span>
     " with length not less than
     <span class="tex-span">
      1
     </span>
     and not greater than
     <span class="tex-span">
      100
     </span>
     .
    </p>
   </div>
   <div class="output-specification">
    <div class="section-title">
     Output
    </div>
    <p>
     Output a single integer, the maximum number of times "
     <span class="tex-font-style-tt">
      VK
     </span>
     " can appear as a substring of the given string after changing at most one character.
    </p>
   </div>
   <div class="sample-tests">
    <div class="section-title">
     Examples
    </div>
    <div class="sample-test">
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>VK<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>1<br/></pre>
     </div>
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>VV<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>1<br/></pre>
     </div>
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>V<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>0<br/></pre>
     </div>
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>VKKKKKKKKKVVVVVVVVVK<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>3<br/></pre>
     </div>
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>KVKV<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>1<br/></pre>
     </div>
    </div>
   </div>
   <div class="note">
    <div class="section-title">
     Note
    </div>
    <p>
     For the first case, we do not change any letters. "
     <span class="tex-font-style-tt">
      VK
     </span>
     " appears once, which is the maximum number of times it could appear.
    </p>
    <p>
     For the second case, we can change the second character from a "
     <span class="tex-font-style-tt">
      V
     </span>
     " to a "
     <span class="tex-font-style-tt">
      K
     </span>
     ". This will give us the string "
     <span class="tex-font-style-tt">
      VK
     </span>
     ". This has one occurrence of the string "
     <span class="tex-font-style-tt">
      VK
     </span>
     " as a substring.
    </p>
    <p>
     For the fourth case, we can change the fourth character from a "
     <span class="tex-font-style-tt">
      K
     </span>
     " to a "
     <span class="tex-font-style-tt">
      V
     </span>
     ". This will give us the string "
     <span class="tex-font-style-tt">
      VKKVKKKKKKVVVVVVVVVK
     </span>
     ". This has three occurrences of the string "
     <span class="tex-font-style-tt">
      VK
     </span>
     " as a substring. We can check no other moves can give us strictly more occurrences.
    </p>
   </div>
  </div>
  <p>
  </p>
 </div>
</div>
